Extremal regularization
نویسنده
چکیده
Extremal regularization finds a model fitting the data to a specified tolerance, and additionally minimizing an auxiliary criterion. It provides relative model/data space weights when no statistical information about the model or data is available other than an estimate of noise level. A version of the Moré-Hebden algorithm using conjugate gradients to solve the various linear systems implements extremal regularization for large scale inverse problems. A deconvolution application illustrates the possibilities and pitfalls of extremal regularization in the linear case.
منابع مشابه
Chaotic Information Processing by Extremal Black Holes
We review an explicit regularization of the AdS2/CFT1 correspondence, that preserves all isometries of bulk and boundary degrees of freedom. This scheme is useful to characterize the space of the unitary evolution operators that describe the dynamics of the microstates of extremal black holes in four spacetime dimensions. Using techniques from algebraic number theory to evaluate the transition ...
متن کاملA Fuzzy Identification Problem for the Stationary Discrete Extremal Fuzzy Dynamic System
This work deals with the problem of the Stationary Discrete Extremal Fuzzy Dynamic System (SDEFDS) identification and briefly discusses the results developed by G. Sirbiladze [10]–[17]. Applying the results of [10] and [11], the fuzzy process with possibilistic uncertainty, the source of which is expert knowledge reflections, is constructed [12]. The dynamics of SDEFDS is described. Based on th...
متن کاملOn the regularization of extremal three-point functions involving giant gravitons
Article history: Received 22 July 2015 Accepted 22 September 2015 Available online 28 September 2015 Editor: N. Lambert
متن کاملThermodynamics of Black Holes in Schrödinger Space
A black hole and a black hyperboloid solutions in the space with the Schrödinger isometries are presented and their thermodynamics is examined. The on-shell action is obtained by the difference between the extremal and non-extremal ones with the unusual matching of the boundary metrics. This regularization method is first applied to the black brane solution in the space of the Schrödinger symme...
متن کاملLogistic regression with weight grouping priors
A generalization of the commonly used Maximum Likelihood based learning algorithm for the logistic regression model is considered. It is well known that using the Laplace prior (L1 penalty) on model coefficients leads to a variable selection effect, when most of the coefficients vanish. It is argued that variable selection is not always desirable; it is often better to group correlated variable...
متن کامل